Efficient Simulations among Several Models of Parallel Computers
نویسندگان
چکیده
منابع مشابه
Statistical Simulations on Parallel Computers
The potential benefits of parallel computing for time-consuming statistical applications are well known, but have not been widely realized in practice, perhaps in part due to associated technical obstacles. This article develops a simple framework for programming statistical simulations using parallel processing, which does not require changing programming language or forgoing the use of standa...
متن کاملLarge Neural Simulations on Large Parallel Computers
Simulations of biologically realistic neurons in large densely connected networks pose many problems to application programmers, particularly on distributed memory computers. We discuss simulations of hundreds of thousands to millions of cells in a model of neocortex in the context of new computing platforms with many tens of thousands to hundreds of thousands of processing elements. We are de...
متن کاملEfficient Bit Reversal Algorithms in Parallel Computers
Fast Fourier Transform is widely used in many areas of engineering and mathematics such as digital signal and image processing systems, and polynomial multiplication. Furthermore, it has an important role in performing parallel simulations such as plasma simulation, weather forecasting, and dynamic fluids. Bit-reversal routine is considered to be an essential part of FFT and that is because of ...
متن کاملTime-Optimal Simulations of Networks by Universal Parallel Computers
For technological reasons, in a realistic parallel computer the processors have to communicate via a communication network with bounded degree. Thus the question for a \good" communication network comes up. In this paper we present such a network, a universal parallel computer (UPC) with the following properties: (i) It has optimal time-loss, namely O(log c) for simulating networks of degree c....
متن کاملLangevin Dynamics Simulations of Macromolecules on Parallel Computers
A parallel algorithm is developed that allows eecient Langevin{dynamics simulations of macromolecular coils, which is the usual structure of synthetic polymers in solution and in bulk. Contrary to usual so{called spatial decomposition algorithms, we map the one{dimensional topology of the chain molecule on the parallel computer. The speedup of the algorithm is measured on diierent multi{process...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1986
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0215008